Revisiting the Brightness Constraint: Probabilistic Formulation and Algorithms

نویسنده

  • Venu Madhav Govindu
چکیده

In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabilistic representation for optical flow. This representation subsumes existing approaches to flow modeling, provides insights into the behaviour and limitations of existing methods and leads to modified algorithms that outperform other approaches that use the brightness constraint. Based on this representation we develop algorithms for flow estimation using different smoothness assumptions, namely constant and affine flow. Experiments on standard data sets demonstrate the superiority of our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

متن کامل

MRF Solutions for Probabilistic Optical Flow Formulations

In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncertainty in the brightness constraint due to errors in image derivative computation. We separate the flow into two onedimensional representations and pose the problem of flow estimation as one of solving for the most pro...

متن کامل

A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

متن کامل

Shape from Intensity Gradient - Systems, Man and Cybernetics, Part A, IEEE Transactions on

Unlike existing global shape-from-shading (SFS) algorithms which involve the brightness constraint in their formulation, we propose a new SFS algorithm which replaces the brightness constraint with an intensity gradient constraint. This is a global approach which obtains the solution by the minimization of an error function over the entire image. Through the linearization of the gradient of the...

متن کامل

Robot Motion Vision Pait I: Theory

A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006